An approach for solving maximal covering location problems with fuzzy constraints
نویسندگان
چکیده
منابع مشابه
Maximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملA Holistic Approach Based on MCDM for Solving Location Problems
Location decision is an integral part of organizational strategies involving many factorsthat may be conflicting in nature. This paper presents a holistic approach of the multi-criteria decisionmaking (MCDM) methodology to select the optimal location(s), which fits best for both investors andmanagers. A case study is also provided to illustrate the application of the proposed holistic approach....
متن کاملFuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem
In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملMaximal Covering Location Problems on networks with regional demand
Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2016
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2016.1204121